|
|
Optimization of a small induction machine’s slots
Šišák, David ; Janda, Marcel (referee) ; Mach, Martin (advisor)
This master thesis deals with optimization of the shape of the stator and rotor slots of induction motor with focusing on increasing efficiency. The theoretical part introduces the principles of optimization algorithms. Another part is devoted to design the shape of slots and its influence on the shape of slots on machine. On the models of motor was conducted the optimized shape of slots by using a genetic algorithm. Firstly, it was performed by using the analytical calculation in the RMxprt program, then by using the finite element method on two different models, whose difference simulates the influence of the production technology on the efficiency of the motor. Laboratory measurement was made on a real machine as well. The results of the measurement, calculations and optimizations are compared in the work.
|
|
| |
|
|
Losses analysis of small induction motors
Šišák, David ; Cipín, Radoslav (referee) ; Mach, Martin (advisor)
This bachelor thesis deals with analysis of losses of small induction motors. The first part of the project introduces the principle of operation and construction of induction motors. Furthermore, there is dealt with issuing each losses, their origin and disposition in induction motor. The project continues performing the analytical computation of the losses of induction motor with an output of 600 W. The losses of the motor are also calculated in the program Maxvell RMxprt. In the practical part, there are the results of the laboratory measurement on that motor and measurements concerning two another small induction motors different in nominal power. In the last part, there are compared the results of individual motor losses, obtained by computations and measuring. There are also compared the measuring results of losses of chosen motors depending on the nominal output.
|
|
| |
|
|
Optimization of a small induction machine’s slots
Šišák, David ; Janda, Marcel (referee) ; Mach, Martin (advisor)
This master thesis deals with optimization of the shape of the stator and rotor slots of induction motor with focusing on increasing efficiency. The theoretical part introduces the principles of optimization algorithms. Another part is devoted to design the shape of slots and its influence on the shape of slots on machine. On the models of motor was conducted the optimized shape of slots by using a genetic algorithm. Firstly, it was performed by using the analytical calculation in the RMxprt program, then by using the finite element method on two different models, whose difference simulates the influence of the production technology on the efficiency of the motor. Laboratory measurement was made on a real machine as well. The results of the measurement, calculations and optimizations are compared in the work.
|
|
|
Losses analysis of small induction motors
Šišák, David ; Cipín, Radoslav (referee) ; Mach, Martin (advisor)
This bachelor thesis deals with analysis of losses of small induction motors. The first part of the project introduces the principle of operation and construction of induction motors. Furthermore, there is dealt with issuing each losses, their origin and disposition in induction motor. The project continues performing the analytical computation of the losses of induction motor with an output of 600 W. The losses of the motor are also calculated in the program Maxvell RMxprt. In the practical part, there are the results of the laboratory measurement on that motor and measurements concerning two another small induction motors different in nominal power. In the last part, there are compared the results of individual motor losses, obtained by computations and measuring. There are also compared the measuring results of losses of chosen motors depending on the nominal output.
|
|
|
A direct solver for finite element matrices requiring O(N log N) memory places
Vejchodský, Tomáš
We present a method that in certain sense stores the inverse of the stiffness matrix in O(N log N) memory places, where N is the number of degrees of freedom and hence the matrix size. The setup of this storage format requires O(N^(3/2)) arithmetic operations. However, once the setup is done, the multiplication of the inverse matrix and a vector can be performed with O(N log N) operations. This approach applies to the first order finite element discretization of linear elliptic and parabolic problems in triangular domains, but it can be generalized to higher-order elements, variety of problems, and general domains. The method is based on a special hierarchical enumeration of vertices and on a hierarchical elimination of suitable degrees of freedom. Therefore, we call it hierarchical condensation of degrees of freedom.
|
guest ::
